Minimizing ROBDD Sizes of Incompletely Speci ed Boolean Functions by Exploiting Strong Symmetries

We present a method computing a minimum sized partition of the variables of an incompletely specied Boolean function into symmetric groups. The method can be used during minimization of robdds of incompletely speci ed Boolean functions. We apply it as a preprocessing step of symmetric sifting presented by Panda [24] and Moller [20] and of techniques for robdd minimization of incompletely speci ed Boolean functions presented by Chang [6] and Shiple [28]. The technique is shown to be very e ective: it improves robdd sizes of symmetric sifting by a factor of 51% and by a factor of 70% in combination with a slightly modi ed version of the technique of Chang and Shiple.